Free Burnside Semigroups
نویسندگان
چکیده
منابع مشابه
Maximal Groups in Free Burnside Semigroups
We prove that any maximal group in the free Burnside semi-group deened by the equation x n = x n+m for any n 1 and any m 1 is a free Burnside group satisfying x m = 1. We show that such group is free over a well described set of generators whose cardinality is the cyclomatic number of a graph associated to the J-class containing the group. For n = 2 and for every m 2 we present examples with 2m...
متن کاملGeometric Semigroup Theory
Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups and automata lead to simplifications of the graphs on which the corresponding finite semigroups act. We show in particular that every finite semigroup can b...
متن کاملOn Semigroups of Matrices in the (max,+) Algebra
We show that the answer to the Burnside problem is positive for semigroups of matrices with entries in the (max;+)-algebra (that is, the semiring (R[ f 1g;max;+)), and also for semigroups of (max;+)-linear projective maps with rational entries. An application to the estimation of the Lyapunov exponent of certain products of random matrices is also discussed. Key-words: Semigroups, Burnside Prob...
متن کاملYet Another Solution to the Burnside Problem for Matrix Semigroups
We use the kernel category to give a finiteness condition for semigroups. As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite.
متن کاملMcCammond's normal forms for free aperiodic semigroups revisited
This paper revisits the solution of the word problem for ω-terms interpreted over finite aperiodic semigroups, obtained by J. McCammond. The original proof of correctness of McCammond’s algorithm, based on normal forms for such terms, uses McCammond’s solution of the word problem for certain Burnside semigroups. In this paper, we establish a new, simpler, correctness proof of McCammond’s algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 35 شماره
صفحات -
تاریخ انتشار 2001